...-... Algebras.
[0,1]-Valued Logic: A Natural Generalization of Boolean Logic
1.0957-Approximation Algorithm for Random MAX-3SAT
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.
"Abstract logics" and "Classical abstract logics" [Book]
...-definable functionals and ... Conversion.
...-definierbare Funktionen auf Peanoalgebren.
“Disorder” in lattices of binumerations
�?lgebras de Hilbert n-valentes
(Pure) logic out of probability.
Today, Logic and Probability are mostly seen as independent fields with a separate history and set of foundations. Against this dominating perception, only a very few people (Laplace, Boole, Peirce) have suspected there was some affinity or relation between them. The truth is they have a considerable common ground which underlies the historical foundation of both disciplines and, in this century, has prompted notable thinkers as Reichenbach [14], Carnap [2] [3] or Popper [12] [13] (and Gaifman [5],...
(T, ⊥, N) fuzzy logic.
To investigate more reasonable fuzzy reasoning model in expert systems as well as more effective logical circuit in fuzzy control, a (T, ⊥, N) fuzzy logic is proposed in this paper by using T-norm, ⊥-norm and pseudo-complement N as the logical connectives. Two aspects are discussed: (1) some concepts of (T, ⊥, N) fuzzy logic are introduced and some properties of (T, ⊥, N) fuzzy logical formulae are discussed. (2) G-fuzzy truth (falsity) of (T, ⊥, N) fuzzy logical formulae are investigated and also...
-tautologies, uniform and non-uniform upper bounds in computation theory
Una -tautologia è una tautologia del tipo avente un solo interpolante di Craig , a meno di equivalenza logica. Utilizzando misure di complessità relative al problema di trovare tale , mostriamo come si possano ottenere limiti non uniformi di complessità mediante limiti uniformi, e viceversa.
σ-ring and σ-algebra of Sets1
In this article, semiring and semialgebra of sets are formalized so as to construct a measure of a given set in the next step. Although a semiring of sets has already been formalized in [13], that is, strictly speaking, a definition of a quasi semiring of sets suggested in the last few decades [15]. We adopt a classical definition of a semiring of sets here to avoid such a confusion. Ring of sets and algebra of sets have been formalized as non empty preboolean set [23] and field of subsets [18],...
ω-Trees in stationary logic
Аксиоматизируемость одной проекции универсально аксиомтизируемого класса алгебраических систем
Алгебраические системы 2-й ступени
Алгебраические эквиваленты некоторых свойств суперинтуиционистских предикатных логик
Алгебраическое доказательство сепарационного свойства для доказуемостно-интуиционистского исчисления
Алгоритмическая природа инвариантных свойств грамматик непосредственно составляющих
Алгоритмические проблемы и иерархии языков первого порядка
Базисы допустимых правил вывода модальных логик S4.2 и S4.2Grz